A Fast Algorithm for Orthogonalizing Polynomials on
نویسندگان
چکیده
This report presents a faster version of the polynomial recursive orthogonalization (PRO) algorithm, which is used in segmented image coding to generate orthonormal base functions on a non-rectangular discrete image. It shows that up to 25% of the oating point operations can be eliminated by using previously computed results; also, some orthogonalizations can be avoided altogether, because they are guaranteed to produce zero functions. In practice, the PRO implementation in this report is 20 to 25% faster than the old algorithm and two to three times faster than Gram-Schmidt orthogonalization.
منابع مشابه
A Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملOn associated polynomials and decay rates for birth-death processes
We consider sequences of orthogonal polynomials and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials. In particular, we relate the supports of the two measures, and their moments. As an application we analyse the relation between two decay rates conn...
متن کاملAssociated polynomials and birth-death processes
We consider sequences of orthogonal polynomials with positive zeros, and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials, with a view to applications in the setting of birth-death processes. In particular, we relate the supports of the two measures,...
متن کاملUsing an Imperialistic Competitive Algorithm in Global Polynomials Optimization (Case Study: 2D Geometric Correction of IKONOS and SPOT Imagery)
The number of high resolution space imageries in photogrammetry and remote sensing society is growing fast. Although these images provide rich data, the lack of sensor calibration information and ephemeris data does not allow the users to apply precise physical models to establish the functional relationship between image space and object space. As an alternative solution, some generalized mode...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کامل